Quartic half-arc-transitive graphs with large vertex stabilizers
نویسنده
چکیده
A 1 2 -arc-transitive graph is a vertexand edgebut not arc-transitive graph. In all known constructions of quartic 1 2 -arc-transitive graphs, vertex stabilizers are isomorphic to Z 2,Z 2 2 or to D8. In this article, for each positive integer m ≥ 1, an infinite family of quartic 1 2 -arctransitive graphs having vertex stabilizers isomorphic to Z m
منابع مشابه
On quartic half-arc-transitive metacirculants
Following Alspach and Parsons, a metacirculant graph is a graph admitting a transitive group generated by two automorphisms ρ and σ , where ρ is (m,n)semiregular for some integers m ≥ 1, n ≥ 2, and where σ normalizes ρ, cyclically permuting the orbits of ρ in such a way that σ has at least one fixed vertex. A halfarc-transitive graph is a vertexand edgebut not arc-transitive graph. In this arti...
متن کاملTransitive Permutation Groups with Non-self-paired Suborbits of Length 2 and Their Graphs
Transitive permutation groups having a non self paired suborbit of length are investigated via the corresponding orbital graphs If G is such a group and X is the orbital graph associated with a sub orbit of length of G which is not self paired then X has valency and admits a vertex and edge but not arc transitive action of G There is a natural balanced orientation of the edge set of X induced a...
متن کاملFinite vertex-primitive and vertex-biprimitive 2-path-transitive graphs
This paper presents a classification of vertex-primitive and vertex-biprimitive 2-path-transitive graphs which are not 2-arc-transitive. The classification leads to constructions of new examples of half-arc-transitive graphs.
متن کاملTwo-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کاملHamiltonicity of 3-Arc Graphs
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph G is defined to have vertices the arcs of G such that two arcs uv, xy are adjacent if and only if (v, u, x, y) is a 3-arc of G. In this paper we prove that any connected 3-arc graph is Hamiltonian, and all iterative 3-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 299 شماره
صفحات -
تاریخ انتشار 2005